On quantifier-rank equivalence between linear orders
نویسندگان
چکیده
منابع مشابه
Linear Orders Realized by C.E. Equivalence Relations
Let E be a computably enumerable (c.e.) equivalence relation on the set ω of natural numbers. We say that the quotient set ω/E (or equivalently, the relation E) realizes a linearly ordered set L if there exists a c.e. relation E respecting E such that the induced structure (ω/E;E) is isomorphic to L. Thus, one can consider the class of all linearly ordered sets that are realized by ω/E; formall...
متن کاملOn Fraïssé's conjecture for linear orders of finite Hausdorff rank
We prove that the maximal order type of the wqo of linear orders of finite Hausdorff rank under embeddability is φ2(0), the first fixed point of the ε-function. We then show that Fräıssé’s conjecture restricted to linear orders of finite Hausdorff rank is provable in ACA0 + “φ2(0) is well-ordered” and, over RCA0, implies ACA ′ 0 + “φ2(0) is well-ordered”.
متن کاملEpimorphisms Between Linear Orders
We study the relation on linear orders induced by order preserving surjections. In particular we show that its restriction to countable orders is a bqo.
متن کاملOn the equivalence between low rank matrix completion and tensor rank
Abstract. The Rank Minimization Problem asks to find a matrix of lowest rank inside a linear variety of the space of n×m matrices. The Low Rank Matrix Completion problem asks to complete a partially filled matrix such that the resulting matrix has smallest possible rank. The Tensor Rank Problem asks to determine the rank of a tensor. We show that these three problems are equivalent: each one of...
متن کاملOn the Equivalence of Two Quantifier Elimination Tests
We prove that, for countable languages, two model-theoretic quantifier elimination tests, one proposed by J. R. Shoenfield and the other by L. van den Dries, are equivalent. §
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2010
ISSN: 0890-5401
DOI: 10.1016/j.ic.2009.11.006